Graph / Feedback arc set (Bibtex)

P433: Enumeration of all minimal feedback arc sets in a graph

Input:

A graph $G$.

Output:

All minimal feedback arc sets in $G$.

Complexity:

Comment:

Reference:

[Yau1967] (Bibtex)

P24: Enumeration of all minimal feedback arc sets in a directed graph

Input:

A directed graph $G=(V,E)$.

Output:

All minimal feedback arc sets in $G$.

Complexity:

$O(|V||E|(|V|+|E|))$ time delay.

Comment:

Theorem 3

Reference:

[Schwikowski2002] (Bibtex)